Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve

نویسندگان

  • Ryutaroh Matsumoto
  • Shinji Miura
چکیده

Under the assumption that we have defining equations of an affine algebraic curve in special position with respect to a rational place Q, we propose an algorithm computing a basis of L(D) of a divisor D from an ideal basis of the ideal L(D +∞Q) of the affine coordinate ring L(∞Q) of the given algebraic curve, where L(D+∞Q) := S∞ i=1 L(D+ iQ). Elements in the basis produced by our algorithm have pairwise distinct discrete valuations at Q, which is convenient in the construction of algebraic geometry codes. Our method is applicable to a curve embedded in an affine space of arbitrary dimension, and involves only the Gaussian elimination and the division of polynomials by the Gröbner basis for the ideal defining the curve. c © 2000 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Algebraic Geometry Codes on the Normalization of a Singular Cab Curve

When we have a singular Cab curve with many rational points, we had better to construct linear codes on its normalization rather than the original curve. The only obstacle to construct linear codes on the normalization is finding a basis of L(∞Q) having pairwise distinct pole orders at Q, where Q is the unique place of the Cab curve at infinity. We present an algorithm finding such a basis from...

متن کامل

Extension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher

Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...

متن کامل

Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton

Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

متن کامل

THE Cab CURVE

We characterize the defining equation of a plane algebraic curve with exactly one rational place Q at infinity, then give a basis of L(mQ) with pairwise distinct pole orders at Q. The defining equation can be regarded as a generalization of the Weierstrass form of a hyperelliptic curve. In this informal note I give an English proof of the results of the Cab curve found by Miura [4, 5, 6]. Throu...

متن کامل

A general construction of Reed-Solomon codes based on generalized discrete Fourier transform

In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes  enjoy nice algebraic properties just as the classic one.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2000